A possibilistic handling of partially ordered information
نویسندگان
چکیده
In standard possibilistic logic, prioritized in formation are encoded by means of weighted knowledge bases. This paper proposes an exten sion of possibilistic logic to deal with partially ordered information which can be viewed as a family of possibilistic knowledge bases. We show that all basic notions of possibilis tic logic have natural counterparts when dealing with partially ordered information. Furthermore, we propose an algorithm which computes plausi ble conclusions of a partially ordered knowledge base.
منابع مشابه
Reasoning with partially ordered information in a possibilistic logic framework
In many applications, the reliability relation associated with available information is only partially defined, while most of existing uncertainty frameworks deal with totally ordered pieces of knowledge. Partial pre-orders offer more flexibility than total pre-orders to represent incomplete knowledge. Possibilistic logic, which is an extension of classical logic, deals with totally ordered inf...
متن کاملHandling partially ordered preferences in possibilistic logic - A survey discussion -
This paper advocates possibilistic logic with partially ordered priority weights as a powerful representation format for handling preferences. An important benefit of such a logical setting is the ability to check the consistency of the specified preferences. We recall how Qualitative Choice Logic statements (and related ones), as well as CP-nets preferences can be represented in this framework...
متن کاملEncoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic
Possibilistic logic offers a convenient tool for handling uncertain or prioritized formulas and coping with inconsistency. Propositional logic formulas are thus associated with weights belonging to a linearly ordered scale. However, especially in case of multiple source information, only partial knowledge may be available about the relative ordering between weights of formulas. In order to cope...
متن کاملPossibilistic logic: a retrospective and prospective view
Possibilistic logic is a weighted logic introduced and developed since the mid-1980s, in the setting of arti(cial intelligence, with a view to develop a simple and rigorous approach to automated reasoning from uncertain or prioritized incomplete information. Standard possibilistic logic expressions are classical logic formulas associated with weights, interpreted in the framework of possibility...
متن کاملPossibilistic reasoning with partially ordered beliefs
This paper presents the extension of results on reasoning with totally ordered belief bases to the partially ordered case. The idea is to reason from logical bases equipped with a partial order expressing relative certainty and to construct a partially ordered deductive closure. The difficult point lies in the fact that equivalent definitions in the totally ordered case are no longer equivalent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003